A point-in-polygon method based on a quasi-closest point
نویسندگان
چکیده
منابع مشابه
A Semi-Lagrangian Closest Point Method for Deforming Surfaces
We present an Eulerian method for the real-time simulation of intrinsic fluid dynamics effects on deforming surfaces. Our method is based on a novel semi-Lagrangian closest point method for the solution of partial differential equations on animated triangle meshes. We describe this method and demonstrate its use to compute and visualize flow and wave propagation along such meshes at high resolu...
متن کاملLevel Set Equations on Surfaces via the Closest Point Method
Level set methods have been used in a great number of applications in R and R and it is natural to consider extending some of these methods to problems defined on surfaces embedded in R or higher dimensions. In this paper we consider the treatment of level set equations on surfaces via a recent technique for solving partial differential equations (PDEs) on surfaces, the Closest Point Method [RM...
متن کاملImprovements in closest point search based on dual HKZ-bases
In this paper we review the technique to solve the CVP based on dual HKZ-bases by J. Blömer [4]. The technique is based on the transference theorems given by Banaszczyk [3] which imply some necessary conditions on the coefficients of the closest vectors with respect to a basis whose dual is HKZ reduced. Recursively, starting with the last coefficient, intervals of length i can be derived for th...
متن کاملComputing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One algorithm runs in O(n) preprocessing time and space and O(log n) query time. The other algorithm runs in O(n ) preprocessing time and O(n log n) space and O(n ) query time. Thus we exhibit a trade-off between preprocessi...
متن کاملClosest point search in lattices
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closest point search algorithm, based on the Schnorr–Euchner variation of the Pohst method, is implemented. Given an arbitrary point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Geosciences
سال: 2010
ISSN: 0098-3004
DOI: 10.1016/j.cageo.2009.06.008